Algebra of Logic Programming
نویسندگان
چکیده
A declarative programming language has two kinds of semantics The more abstract helps in reasoning about speci cations and correctness while an operational semantics determines the manner of program exe cution A correct program should reconcile its abstract meaning with its concrete interpretation To help in this we present a kind of algebraic semantics for logic pro gramming It lists only those laws that are equally valid for predicate calculus and for the standard depth rst strategy of Prolog An alterna tive strategy is breadth rst search which shares many of the same laws Both strategies are shown to be special cases of the most general strat egy that for tree searching The three strategies are de ned in the lazy functional language Haskell so that each law can be proved by standard algebraic reasoning The laws are an enrichment of the familiar categorical concept of a monad and the links between such monads are explored
منابع مشابه
EQ-logics with delta connective
In this paper we continue development of formal theory of a special class offuzzy logics, called EQ-logics. Unlike fuzzy logics being extensions of theMTL-logic in which the basic connective is implication, the basic connective inEQ-logics is equivalence. Therefore, a new algebra of truth values calledEQ-algebra was developed. This is a lower semilattice with top element endowed with two binary...
متن کاملA Relational Algebra for Functional Logic Deductive Databases
In this paper, we study the integration of functional logic programming and databases by presenting a data model, and a query and data definition language. The query and data definition language is based on the use of a set of algebra operators over an extended relational algebra. The algebra expressions built from the extended algebra are used for expressing queries and rules. In addition, alg...
متن کاملA Fast and Self-Repairing Genetic Programming Designer for Logic Circuits
Usually, important parameters in the design and implementation of combinational logic circuits are the number of gates, transistors, and the levels used in the design of the circuit. In this regard, various evolutionary paradigms with different competency have recently been introduced. However, while being advantageous, evolutionary paradigms also have some limitations including: a) lack of con...
متن کاملEquality propositional logic and its extensions
We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...
متن کاملCategory-based Semantic Paramodulation
We introduce the concept of semantic paramodulation as a \semantic" de nition of paramodulation (in the sense that it applies to any model, not only to the term algebra) within the framework of category-based equational logic (introduced by [8, 9]). This not only generalises the traditional syntactic approaches to paramodulation, but also provides an abstract framework for a uni ed treatment of...
متن کامل